Acute Triangulations of Polyhedra and R
نویسندگان
چکیده
We study the problem of acute triangulations of convex polyhedra and the space R. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n-cube do not exist for n≥4. Further, we prove that acute triangulations of the space R do not exist for n≥5. In the opposite direction, in R, we present a construction of an acute triangulation of the cube, the regular octahedron and a non-trivial acute triangulation of the regular tetrahedron. We also prove nonexistence of an acute triangulation of R if all dihedral angles are bounded away from π/2.
منابع مشابه
Acute triangulations of polyhedra and ℝ N
We study the problem of acute triangulations of convex polyhedra and the space Rn. Here an acute triangulation is a triangulation into simplices whose dihedral angles are acute. We prove that acute triangulations of the n–cube do not exist for n ≥ 4. Further, we prove that acute triangulations of the space Rn do not exist for n ≥ 5. In the opposite direction, in R3, we present a construction of...
متن کاملA Variational Principle for Weighted Delaunay Triangulations and Hyperideal Polyhedra
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted Delaunay triangulations may be interpreted as images of hyperbolic polyhedra with one vertex on and the remaining vertices beyond the infinite boundary of hype...
متن کاملay 2 00 8 Notes on Convex Sets , Polytopes , Polyhedra Combinatorial Topology , Voronoi Diagrams and Delaunay Triangulations
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...
متن کاملGraph-Theoretical Conditions for Inscribability and Delaunay Realizability
We present new graph-theoretical conditions for polyhedra of inscribable type and Delaunay triangulations. We establish several sufficient conditions of the following general form: if a polyhedron has a sufficiently rich collection of Hamiltonian subgraphs, then it is of inscribable type. These results have several consequences: • All 4-connected polyhedra are of inscribable type. • All simplic...
متن کاملAspects of Convex Geometry Polyhedra, Shellings, Voronoi Diagrams, Delaunay Triangulations
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009